Design and analysis of the redundancy allocation problem using a greedy technique
نویسندگان
چکیده
منابع مشابه
A redundancy allocation problem with the choice of redundancy strategies by a memetic algorithm
This paper proposes an efficient algorithm based on memetic algorithm (MA) for a redundancy allocation problem without component mixing (RAPCM) in a series-parallel system when the redundancy strategy can be chosen for individual subsystems. Majority of the solution methods for the general RAPCM assume that the type of a redundancy strategy for each subsystem is pre-determined and known a prior...
متن کاملA Memtic genetic algorithm for a redundancy allocation problem
Abstract In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined. Tavakkoli- Moghaddam presented a series-parallel redundancy allocation problem with mixing components (RAPMC) in which the redundancy strategy can be chosen for individual subsystems. In this paper, we present a bi-objective redundancy allocation when the redundancy strategies for...
متن کاملRedundancy allocation problem for k-out-of-n systems with a choice of redundancy strategies
To increase the reliability of a specific system, using redundant components is a common method which is called redundancy allocation problem (RAP). Some of the RAP studies have focused on k-out-of-n systems. However, all of these studies assumed predetermined active or standby strategies for each subsystem. In this paper, for the first time, we propose a k-out-of-<em...
متن کاملIncreasing the Reliability and the Profit in a Redundancy Allocation Problem
This paper proposes a new mathematical model for multi-objective redundancy allocation problem (RAP) without component mixing in each subsystem when the redundancy strategy can be chosen for individual subsystems. Majority of the mathematical model for the multi-objective redundancy allocation problems (MORAP) assume that the redundancy strategy for each subsystem is predetermined and fixed...
متن کاملa redundancy allocation problem with the choice of redundancy strategies by a memetic algorithm
this paper proposes an efficient algorithm based on memetic algorithm (ma) for a redundancy allocation problem without component mixing (rapcm) in a series-parallel system when the redundancy strategy can be chosen for individual subsystems. majority of the solution methods for the general rapcm assume that the type of a redundancy strategy for each subsystem is pre-determined and known a prior...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOSR Journal of Computer Engineering
سال: 2016
ISSN: 2278-8727,2278-0661
DOI: 10.9790/0661-1805011119